Characteristic Specific Prioritized Dynamic Average Burst Round Robin Scheduling for Uniprocessor and Multiprocessor Environment
نویسندگان
چکیده
منابع مشابه
Characteristic specific prioritized dynamic average burst round robin scheduling for uniprocessor and multiprocessor environment
CPU scheduling is one of the most crucial operations performed by operating systems. Different conventional algorithms like FCFS, SJF, Priority, and RR (Round Robin) are available for CPU Scheduling. The effectiveness of Priority and Round Robin scheduling algorithm completely depends on selection of priority features of processes and on the choice of time quantum. In this paper a new CPU sched...
متن کاملGroup Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems
We present Group Ratio Round-Robin (GR), the first proportional share scheduler that combines accurate proportional fairness scheduling behavior with O(1) scheduling overhead on both uniprocessor and multiprocessor systems. GR uses a simple grouping strategy to organize clients into groups of similar processor allocations which can be more easily scheduled. Using this strategy, GR combines the ...
متن کاملDynamic Task-Scheduling in Grid Computing using Prioritized Round Robin Algorithm
Over the years, grid computing has emerged as one of the most viable and scalable alternatives to high performance supercomputing, tapping into computing power of the order of Gigaflops. However, the inherent dynamicity in grid computing has made it extremely difficult to come up with near-optimal solutions to efficiently schedule tasks in grids. The present paper proposes a novel grid-scheduli...
متن کاملScheduling Algorithm for Real-time Burst Traffic Using Dynamic Weighted round Robin
In this paper, we propose a new scheduling algorithm, called the Dynamic Weighted Round Robin (DWRR) scheduling discipline, which is suitable for real-time variable bit rate (rtVBR) service as well as other services such as constant bit rate (CBR), non real-time VBR (nrtVBR), available bit rate (ABR) services in a high-speed network. We employ dynamic weight to serve a queue associated with act...
متن کاملBurst Round Robin as a Proportional-Share Scheduling Algorithm
In this paper we introduce Burst Round Robin, a proportional-share scheduling algorithm as an attempt to combine the low scheduling overhead of round robin algorithms and favor shortest jobs. As being documented that weight readjustment enables existing proportional share schedulers to significantly reduce, but not eliminate, the unfairness in their allocations. We present a novel weight adjust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2021
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.3770660